- Abbreviated I/O bound. A condition in which the speed of operation of the input/output port limits the speed of program execution. Getting the data into and out of the computer is more time-consuming than actually processing that same data.See also computation bound.
Dictionary of networking . 2014.
Look at other dictionaries:
Output-sensitive algorithm — In computer science, an output sensitive algorithm is an algorithm whose running time depends not only on the size of the input but also on the size of the output. For certain problems where the output size varies widely, for example from linear… … Wikipedia
computation bound — A condition in which the speed of operation of the processor actually limits the speed of program execution. The processor is limited by the number of arithmetic operations it can perform. See also input/output bound … Dictionary of networking
I/O bound — See input/output bound … Dictionary of networking
harmonically bound — verb Of an input output pair, to incur a proper subset of constraint violations of a different input output pair. :: In the example below, β is harmonically bounded by α: :::| class= wikitable style= text align: center; | Input γ || Constraint 1… … Wiktionary
I/O bound — In computer science, I/O bound refers to a condition in which the time it takes to complete a computation is determined principally by the period of time spent waiting for input/output operations to be completed. This is the opposite of a task… … Wikipedia
I/O bound — adjective Of total system throughput, being limited by the input/output rate, rather than by processing speed of the CPU … Wiktionary
ограниченный быстродействием процессора — (См. input output bound). [Е.С.Алексеев, А.А.Мячев. Англо русский толковый словарь по системотехнике ЭВМ. Москва 1993] Тематики информационные технологии в целом EN processor bound … Справочник технического переводчика
Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… … Wikipedia
Rate–distortion theory — is a major branch of information theory which provides the theoretical foundations for lossy data compression; it addresses the problem of determining the minimal amount of entropy (or information) R that should be communicated over a channel, so … Wikipedia
Fortran language features — This is a comprehensive overview of features of the Fortran 95 language, the version supported by almost all existing Fortran compilers. Old features that have been superseded by new ones are not described few of those historic features are used… … Wikipedia